Energy efficient randomised communication in unknown AdHoc networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Energy Efficient Randomized Communication in Unknown AdHoc Networks

This paper studies broadcasting and gossiping algorithms in random and general AdHoc networks. Our goal is not only to minimise the broadcasting and gossiping time, but also to minimise the energy consumption, which is measured in terms of the total number of messages (or transmissions) sent. We assume that the nodes of the network do not know the network, and that they can only send with a fix...

متن کامل

A Survey on Energy efficient protocols in Mobile Adhoc Networks

Mobile adhoc network is an independent group of mobile nodes in which communicate over relatively bandwidth restricted wireless links. The nodes in mobile adhoc network are mobile so that the topology of the network may change quickly and unpredictably over time. In a mobile adhoc network it is very difficult to achieve significant improvement in the energy efficiency and enhance lifetime of th...

متن کامل

Distributed Algorithm for Energy Efficient Multicasting in Wireless Adhoc Networks

On wireless computer networks, ad-hoc mode is a method for wireless devices to directly communicate with each other. Operating in ad-hoc mode allows all wireless devices within range of each other to discover and communicate in peer-to-peer fashion without involving central access points (including those built in to broadband wireless routers). An ad-hoc network tends to feature a small group o...

متن کامل

ENERGY-EFFICIENT DESIGN OF ADHOC AND SENSOR NETWORKS by

ENERGY-EFFICIENT DESIGN OF ADHOC AND SENSOR NETWORKS

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2009

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2009.02.002